Speech label accelerators and techniques for using same

ABSTRACT

Speech Label Accelerators (SLAs) are provided that comprise an indirect memory, atom value memory, and adder circuitry. Optionally, the SLAs also comprise an accumulator, a load/accumulate multiplexer (mux), and a control unit. There are a variety of different configurations for the adder circuitry, and a configuration can be selected based on speed, power, and area requirements. A number of techniques are provided that allow a system having an SLA to handle more dimensions, atoms, or both than the SLA was originally designed for. A “zig-zag” method is provided that speeds processing in a system when using more dimensions than the SLA was originally designed for. Generally, the kernels used by the SLA will be Gaussian and separable, but non-Gaussian kernels and partially separable kernels may also be used by the SLA.

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of U.S. Provisional Application No. 60/222,819, filed Aug. 4, 2000.

FIELD OF THE INVENTION

[0002] The present invention relates to speech recognition and, more particularly, to Speech Label Accelerators (SLAs) and techniques for using such SLAs.

BACKGROUND OF THE INVENTION

[0003] Speech recognition, in which speech is translated to text, is currently a computationally intensive task. Additionally, much of the recognition is performed in software. For a personal computer or a workstation, recognition of the speech of a single person generally does not adversely affect the operation of the computer. This is true because the person usually has only the speech recognition system running, along with perhaps a word processor. Moreover, current processors are quite fast and memory is relatively inexpensive.

[0004] However, for some systems, such as a Personal Digital Assistant (PDA), speech recognition is problematic. Similar devices include other small, hand-held devices and set-top boxes. These devices generally do not contain enough processing power to run a speech recognizer and other software. Consequently, speech recognition is relatively unused on these devices.

[0005] Another system that can have problems with speech recognition is a large-scale recognition system. In this type of system, multiple utterances from different speakers are translated to text simultaneously. While it is possible to purchase larger and faster systems in order to help translate this amount of speech, it would be beneficial to reduce the load on the processors of the system when the system performs speech recognition. The latter would allow the system to use the extra processing power on other tasks or to accommodate additional simultaneous speakers.

[0006] Consequently, a need exists for techniques to reduce the computational load of a processor during speech recognition.

SUMMARY OF THE INVENTION

[0007] The present invention provides Speech Label Accelerators (SLAs) and techniques for using such SLAs. The present invention speeds processing during the labeling stage of a speech recognizer and frees one or more processors from performing labeling.

[0008] Broadly, Speech Label Accelerators (SLAs) are provided that comprise an indirect memory, atom value memory, and adder circuitry. Optionally, the SLAs also comprise an accumulator, a load/accumulate multiplexer (mux), and a control unit. As explained in more detail below, the indirect memory acts to select atom values from the atom value memory. The atoms are added to determine an approximate value for a kernel or the logarithm of a kernel. Consequently, the SLA allows fast and efficient computation of kernels. The kernels may be subsequently used to determine leaf values, which are then used to determine a word or phrase for a segment of speech.

[0009] There are a variety of different configurations for the adder circuitry, and a configuration can be selected based on bandwidth, latency, power, and area requirements. Additionally, a number of techniques are provided that allow a system having an SLA to handle more dimensions, atoms, or both, than the SLA was originally designed for. Moreover, a “zig-zag” method is provided that speeds processing in a system when using more dimensions than the SLA was originally designed for. Generally, the kernels used by the SLA will be Gaussian and separable, but non-Gaussian kernels and partially separable kernels may also be used by the SLA.

[0010] A more complete understanding of the present invention, as well as further features and advantages of the present invention, will be obtained by reference to the following detailed description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011]FIG. 1 shows an exemplary system for converting speech to text;

[0012]FIG. 2 shows a graph illustrating several two-dimensional Gaussian probability density functions (pdfs), used to illustrate separability;

[0013]FIG. 3 shows a graph illustrating a two-dimensional Gaussian pdf, used to illustrate separability;

[0014]FIG. 4 is a block diagram of a memory illustrating exemplary indirect memory, atom value memory, and accumulator memory, in accordance with one embodiment of the present invention;

[0015]FIG. 5 is a block diagram of a Speech Label Accelerator (SLA), in accordance with one embodiment of the present invention;

[0016]FIG. 6 is a table of exemplary values for variables shown in FIG. 5;

[0017]FIG. 7 is a block diagram of a pipelined tree of adders used for adder circuitry, in accordance with one embodiment of the present invention;

[0018]FIG. 8 is a single dimension of a pipelined adder chain, in accordance with one embodiment of the present invention;

[0019]FIG. 9 is an SLA that uses multiple single dimension pipelined adder chains, as shown in FIG. 8, in accordance with one embodiment of the present invention;

[0020]FIGS. 10 through 13 illustrate data flow through the SLA of FIG. 9, in accordance with one embodiment of the present invention;

[0021]FIG. 14 is a block diagram of a portion of an SLA, in accordance with one embodiment of the present invention;

[0022]FIG. 15 is illustrates how the portion of the SLA shown in FIG. 14 can be integrated into a system, in accordance with one embodiment of the present invention;

[0023]FIG. 16 is a flowchart of a method to operate on more dimensions than an SLA was originally designed to handle, in accordance with one embodiment of the present invention;

[0024]FIG. 17 illustrates an exemplary system for handling more dimensions than an SLA was originally designed for, in accordance with one embodiment of the present invention;

[0025]FIG. 18 is a flowchart of a method for performing hierarchical labeling when operating with an SLA, in accordance with one embodiment of the present invention;

[0026]FIG. 19 illustrates a block diagram of a system for performing a “zig-zag” method that speeds processing of blocks of dimensions, in accordance with embodiments of the present invention;

[0027]FIG. 20 illustrates a block diagram of a system on a chip that incorporates an SLA, in accordance with one embodiment of the present invention;

[0028]FIGS. 21 through 23 are tables of exemplary expressions, which are used to determine potential load on a system bus for an exemplary SLA, in accordance with one embodiment of the present invention;

[0029]FIG. 24 is a block diagram of the SLA of FIG. 20, in accordance with one embodiment of the present invention; and

[0030]FIG. 25 is a diagram of a method for using the SLA of FIG. 24, in accordance with one embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0031] As previously discussed, the Speech Label Accelerators (SLAs) of the present invention speed the labeling phase of the speech recognition computation. Due to the length of the discussion here, a number of headings are used for readability purposes. The headings should not be considered limiting in any way.

[0032] 1. Introduction

[0033] The organization of this document is as follows. Section 2 begins with a review of concepts and notation, and also describes the mathematical task that comprises labeling. Here, the key characteristic of separability, which a function should exhibit for the present invention to apply, is identified. In Section 3, the basic theory behind the invention is explained, and it is shown how the invention exploits separability. Then in Section 4, it is shown how the techniques of the previous sections may be designed as an apparatus. This section includes a discussion of the wide variety of hardware designs that are possible for the same basic idea. In Section 5, various extensions and refinements are described. In Section 6, a variety of practical issues, such as interaction with a speech recognition system and the load that the SLA places on a system bus, are discussed.

[0034] 2. Fundamentals

[0035] 2.1 Basic Definitions and Notation

[0036] Turning now to FIG. 1, an exemplary speech recognition system 100 is shown. Speech recognition system 100 operates on a speech signal 105 to produce a best word or phrase 145. System 100 comprises a pre-processing block 110, a cepstral estimation block 120, a labeler 130, and a trellis match block 140.

[0037] Let s(t) represent a continuous-time, continuous-amplitude audio signal 105, which is assumed to contain some speech that is to be decoded into text. Let this signal be quantized in time and in amplitude by pre-processing block 110, yielding a sequence of samples denoted s₀,s₁, . . . ,s_(i). In the first stage of the speech recognition computation, this stream of samples is divided into equal-sized, overlapping blocks of contiguous samples. Each block is called a frame. A typical frame contains 256 samples. Thus, signal 115 is a series of overlapping frames. Those skilled in the art will realize that, to convert the speech signal 105 into frames 115, the pre-processing block 110 can contain such devices as an analog-to-digital converter, a window/filter, and a Fast Fourier Transform.

[0038] By applying selected signal-processing operations, for instance, mel-frequency cepstral estimation 120, each frame from signal 115 is converted into an observation vector. Signal 125 comprises a series of observation vectors. The relation between frames and observation vectors is one-to-one. The sequence of frames 115 is written as x₀,x₁, . . . x_(j), and the associated sequence of observation vectors 125 is written as ν₀, ν₁, . . . ν_(j). The SLA operates on this sequence of observation vectors, one vector at a time. The SLA performs the work of labeling block 130. The labeling block 130 performs a computation that is discussed below and determines probabilities 135 for a number of phones. Phones are small, indivisible acoustic elements of speech. Trellis match 140 then performs a search and selects a best word or phrase 145. Now that an overall system has been described, SLA 130 will be described in more detail.

[0039] Each observation vector ν_(j) contains some fixed number of elements. Call this number d, short for “dimension,” which is a common term used to describe this number. A typical value for d is 40.

[0040] In speech recognition parlance, an acoustic model is a set of d-dimensional probability density functions or pdfs, hereafter M={P(·|l)}_(l=1) ^(L). Each such pdf is typically implemented as a mixture of d-dimensional Gaussians, thus

P(·|l)=w ₁ g _(l1)(·)+w ₂ g _(l2)(·)+ . . . +w _(n) g _(l) _(nl) (·)  (1)

[0041] with $\begin{matrix} {{{\sum\limits_{i = l}^{n_{i}}w_{i}} = 1},{w_{i} \geq 0.}} & (2) \end{matrix}$

[0042] Here g_(lj)(·) is the jth Gaussian of pdf l, and there are all together n_(l) Gaussians in the lth pdf. When P(·|l) has the form given by Equations (1) and (2), it is typically called a Gaussian Mixture Model (GMM). The function P(·|l) is sometimes also called a leaf, because such functions are distributed among the leaves of a family of decision trees.

[0043] The computation that the SLA speeds up (or in fact approximates, by a procedure detailed below) is the following. Given a single observation vector, ν, associated with a single frame of speech, the top-ranking K leaves l₁, l₂, . . . l_(k) in the set M are to be determined, as ordered by the likelihoods {P(ν|l)}_(l=1) ^(L). Although in principle this involves computing the value of all L leaves present in the acoustic model M, in fact a hierarchical scheme, which is described below in Section 5.3, makes it possible to compute just a subset of leaf values. In any event, the heart of the SLA is a circuit that permits the fast approximate computation of a large collection of values P={P(ν|l)} for a fixed observation vector ν.

[0044] To understand the invention, it is necessary to have some additional detail on the structure of each Gaussian g_(lj)(·). Specifically, in order to apply the invention, each Gaussian should at least partially satisfy a condition that is referred to as “separability” herein. This condition is defined in Section 2.2, and then it is shown in Section 2.3 that a useful subclass of Gaussians (or rather their logarithms) is separable. In fact, any multivariate probability density function that is separable or partially separable may be treated by the speech label accelerator. A few visual examples are given in Section 2.4 to illustrate functions that are separable and not separable (but might be partially separable).

[0045] 2.2 Separability: Definition

[0046] The definition of separability is as follows. Let ƒ be a function from R^(d) to R. Consider a fixed observation vector νεR^(d), and let the elements of the observation vector be ν₀, ν₁, . . . , ν_(d−1). (Note that the index here denotes different elements of the single observation vector ν, and not the sequence of observation vectors discussed above.) It is said that the function ƒ(ν) is “completely separable” (or more simply, just “separable”) if there exist d individual functions ƒ₀, ƒ₁, . . . ƒ_(d−1), each a map from R to R, such that

ƒ(ν)=ƒ₀(ν₀)+ . . . ƒ_(d−1)  (3)

[0047] The word “completely” denotes the decomposition of ƒ into d distinct functions, each depending upon a single element of ν. The individual functions ƒ₀. . . ƒ_(d−1) will be called “splitting functions of ƒ′ herein, or just “splitting functions” for short.

[0048] Later on, it will be shown that a less restrictive condition, called partial separability, may also be exploited by the SLA, though to a lesser extent. This is discussed in Section 5.4 below.

[0049] 2.3 Separability: Mathematical Example

[0050] As is now demonstrated, the function log g_(lj)(·) is separable, providing that the covariance matrix of g_(lj)(·) is diagonal. To see this, write g(ν) for g_(lj)(ν), and recall that the general form of a d-dimensional Gaussian g(ν) is: $\begin{matrix} {{{g(v)} = {\frac{1}{\left. \left( {2\pi} \right)^{d/2} \middle| \left. \sum \right|^{1/2} \right.}e^{{- \frac{1}{2}}{({v - \mu})}^{T}{\sum^{- 1}{({v - \mu})}}}}},} & (4) \end{matrix}$

[0051] where μ is the d-dimensional mean vector of th Gaussian, and Σ is its d×d covariance matrix.

[0052] Suppose now that Σ is diagonal, that is $\begin{matrix} {\sum{= \begin{bmatrix} \sigma_{1}^{2} & \quad & \quad & \quad \\ \quad & \sigma_{2}^{2} & \quad & \quad \\ \quad & \quad & ⋰ & \quad \\ \quad & \quad & \quad & \sigma_{d}^{2} \end{bmatrix}}} & (5) \end{matrix}$

[0053] where empty elements are zeros. Recalling that the determinant of a diagonal matrix is the product of the diagonal elements, Equation (4) may be written as: $\begin{matrix} {{g(v)} = {{\frac{1}{\left( {2\pi} \right)^{d/2}\sigma_{1}{\cdots\sigma}_{d}}\exp} - {\frac{1}{2}{\left( {\left( \frac{v_{1} - \mu_{1}}{\sigma_{1}} \right)^{2} + \cdots + \left( \frac{v_{d} - \mu_{d}}{\sigma_{d}} \right)^{2}} \right).}}}} & (6) \end{matrix}$

[0054] It follows then that $\begin{matrix} {{\log \quad {g(v)}} = {{{- \frac{1}{2}}\left( \frac{v_{1} - \mu_{1}}{\sigma_{1}} \right)^{2}} - {\log \sqrt{2\pi}\sigma_{1}} - \cdots - {\frac{1}{2}\left( \frac{v_{d} - \mu_{d}}{\sigma_{d}} \right)^{2}} - {\log \sqrt{2\pi}{\sigma_{d}.}}}} & (7) \end{matrix}$

[0055] It is clear then that by defining the family of functions $\begin{matrix} {{f_{i}(x)} = {{{- \frac{1}{2}}\left( \frac{x_{i} - \mu_{i}}{\sigma_{i}} \right)^{2}} - {\log \sqrt{2\pi}\sigma_{i}}}} & (8) \end{matrix}$

[0056] for i=1, . . . , d that the decomposition required to fulfill Equation (3) above has been demonstrated. 2.4 Separability: Visual Examples

[0057] Separability may also be visually explained. Turning to FIG. 2, a graph is shown of three representations 210, 220, and 230 of two-dimensional Gaussian pdfs. These representations 210, 220, and 230 are basically contour lines of two-dimensional Gaussian pdfs, where the contour lines are chosen at approximately the variances of the two-dimensional pdfs. Projecting these two-dimensional pdfs onto the X plane results in a one-dimensional pdf 211 that corresponds to representation 210, a one-dimensional pdf 221 that corresponds to representation 220, and a one-dimensional pdf 231 that corresponds to representation 230. Similarly, projecting these two-dimensional pdfs onto the Y plane results in a one-dimensional pdf 212 that corresponds to representation 210, a one-dimensional pdf 222 that corresponds to representation 220, and a one-dimensional pdf 232 that corresponds to representation 230.

[0058] The two-dimensional pdfs that form representations 210, 220, and 230 are separable because these two-dimensional pdfs can be separated into one-dimensional pdfs on the X and Y planes, and the one-dimensional pdfs from the X and Y planes can be used to reconstruct the original two-dimensional pdfs. For example, if one multiplies one-dimensional pdf 211 by one-dimensional pdf 212, the original two-dimensional pdf (as illustrated by representation 210) results. The pdfs 233 and 234 are discussed below.

[0059]FIG. 3 shows a graph having a representation 310 of a two-dimensional pdf. As before, representation 310 is basically a contour line of a two-dimensional Gaussian pdf, where the contour line is chosen at approximately the variance of the two-dimensional pdf. When the two-dimensional Gaussian pdf is projected onto the X axis, one-dimensional Gaussian pdf 311 results, and when the two-dimensional Gaussian pdf is projected onto the Y axis, one-dimensional Gaussian pdf 312 results. However, when the two one-dimensional pdfs 311 and 312 are multiplied, a two-dimensional Gaussian pdf represented by representation 320 is formed. As can be seen, the representation 320 is different than representation 310, which means that the two two-dimensional Gaussian pdfs are different. This means that the two-dimensional Gaussian pdf represented by representation 310 is not separable.

[0060] However, it might be possible that the two-dimensional Gaussian pdf represented by representation 310 could be part of a ten-dimensional, for example, partially separable Gaussian pdf. In the latter situation, the ten-dimensional Gaussian pdf could be separated into five two-dimensional Gaussian pdfs (similar to the two-dimensional Gaussian pdf represented by representation 310) that can then be used to reconstruct the original ten-dimensional Gaussian pdf. While the ten-dimensional Gaussian pdf is not completely separable, in that it cannot be separated into ten functions that can be multiplied to recreate the original ten-dimensional Gaussian pdf, it is partially separable, in that it can be separated into five functions that can be multiplied to recreate the original ten-dimensional Gaussian pdf.

[0061] It should be noted that separability is not limited to Gaussian pdfs.

[0062] 3. Theory of Atoms and Their Use

[0063] Consider once again the model M. As defined above, this is a large collection of pdfs, where each pdf is expressed as a mixture of Gaussians. For now, it is assumed that each Gaussian is diagonal, and therefore completely separable.

[0064] However, the present invention applies to the more general case of any completely separable function, which is hereafter referred to as a “log kernel.” To interpret the text below in its full generality, the word “Gaussian” below may be replaced by “kernel.” Moreover, as discussed below, the present invention applies to partially separable functions.

[0065] 3.1 Basis

[0066] It is implicit from Equation (1) that each Gaussian g_(lj) is assimilated to a particular pdf P(·|l), but for the moment this is ignored. Also, from now on, both the function g_(lj)(·) (i.e., a “kernel”) and its logarithm log g_(lj)(·) (i.e., a “log kernel”) will be referred to as a “Gaussian,” though of course this is true only of the former. It will be clear from context what is meant.

[0067] Consider the set

L={log g _(lj)|for l=1, . . . , L, with j=1, . . . , n_(l)}  (9)

[0068] of all Gaussians appearing in any pdf of the model M. Ignoring the association between Gaussians and specific leaves, this set may be more simply written as

L={log g _(j)|for j=1, . . . , M},

[0069] where $M = {\sum\limits_{l = 1}^{L}n_{i}}$

[0070] is the total number of Gaussians in the model M. Note that any given log g_(j) splits into functions ƒ_(j,i) for i=0, . . . , d−1. The function ƒ_(j,i) may be referred to as the ith component of log g_(j), where ƒ_(j,i) is defined in the obvious way according to Equation (8), with μ_(j,i) replacing μ_(i) and σ_(j,i) replacing σ_(i). That is, μ_(j,i) is the ith component of the mean vector μ_(j) assimilated to g_(j), and likewise for σ_(j,i). What will be demonstrated is an easy way to compute an estimate of every function in L, for a given fixed observation vector ν.

[0071] By the earlier argument, each function in L is completely separable. Define a collection of d sets L₀, . . . , L_(d−1) as follows: L_(i) is the collection of all ith components of all functions appearing in L. Thus, L_(i)={ƒ_(j,i)}_(j=1) ^(M). Now a key empirical observation may be made. This key observation is that, in general, for large collections of Gaussian mixtures like M, the number of distinct <μ_(j,i,)σ_(j,i)> value pairs appearing in the functions of L is relatively small, even when the total number of distinct Gaussians in M is large. Moreover, even if the exact values of the multitude of <μ_(j,i)ν_(j,i) > values are distinct, to a good approximation they can be represented by a relatively small number of values. For instance, it has been empirically observed that for an acoustic model M containing tens of thousands or even hundreds of thousands of Gaussians, it suffices to have no more than 64 representatives per dimension.

[0072] An example will make this more clear. Suppose a model consists of eight Gaussians. Fix a particular dimension i of interest, and write down the <μ,σ> value pairs for the ith component of the eight log Gaussians. Suppose they are as follows: μ values 0.1 2.5 0.0 2.5 0.1 2.4 2.4 2.5 σ values 3.3 1.1 3.0 1.0 3.1 1.2 1.0 1.2 atom index 1 2 1 2 1 2 2 2

[0073] (The last line of this table will be explained momentarily.) Looking at these numbers, the intuition is strong that only two <μ,σ> value pairs are required to represent the eight distinct log Gaussians. These are respectively <0.0,3.0> and <2.5,1.0>. These are called the atoms for the given dimension i, and name them atom 0 and atom 1, or α_(i0) and α_(i1) respectively. The association between a given exact <ν,σ> value pair, and the atom that best represents it, is given in the third row “atom index” above. Note that this association depends only upon the μ and σ parameters of the elements of L_(i); the value of any observation vector has not even been considered in this discussion.

[0074] It is now explained why this is of value in this computation. Assume that a fixed collection of atoms <{tilde over (μ)}_(1i), σ_(li)>, . . . , <{tilde over (μ)}_(Ai), σ_(Ai)> has been chosen in each dimension. Consider a given observation vector ν, and suppose that it is desirable to compute the value of every function in L at ν, which is to say {log g_(lj)(ν)|for l=1, . . . , L, j=1, . . . , n_(l)}. To a good approximation, this computation may be performed as follows.

[0075] First, determine the value of each atom in each dimension. Note that by virtue of the definition of separability, the atoms of dimension i depend only upon the value of ν_(i). Thus, the following occurs $\begin{matrix} {{a_{i0}\left( v_{i} \right)} = {{{- \frac{1}{2}}\left( \frac{v_{i} - 0.0}{3.0} \right)^{2}} - {\log \left( {\sqrt{2\pi} \times 3.0} \right)}}} & (11) \\ {{a_{i1}\left( v_{i} \right)} = {{{- \frac{1}{2}}\left( \frac{v_{i} - 2.5}{1.0} \right)^{2}} - {{\log \left( {\sqrt{2\pi} \times 1.0} \right)}.}}} & (12) \end{matrix}$

[0076] This step is referred to herein as an atom value computation.

[0077] Atoms may also be suitably described through reference to a diagram. Returning to FIG. 2, this figure shows two one-dimensional pdfs 211 and 221 that are projections on the X axis of two-dimensional pdfs illustrated by representations 210 and 220, respectively. It can be seen that the two pdfs 211 and 221 are very similar. It could be that pdf 211 would be chosen as an atom to describe pdf 221. It can be seen that there will be some error when using atom 211 to calculate values associated with pdf 221. However, the error should be small.

[0078] It should be noted that there are a variety of techniques for determining atoms. While an existing pdf may be used as an atom, averaging or other mathematical techniques may be used to determine atoms. Atoms are described in U.S. Pat. No. 5,280,562, entitled “Speech Coding Apparatus with Single-Dimension Acoustic Prototypes for a Speech Recognizer,” issued Jan. 18, 1994, the disclosure of which is incorporated herein by reference. Thus, pdf 233 (i.e., an atom function) could be chosen as an atom to represent pdfs 22 and 232, which are kernel functions. Similarly, pdf 234 could be chosen to represent pdfs 211 and 221.

[0079] Now one is ready to determine, to an approximation, the actual values of the functions in L. Consider any one such function log g(·), and suppose that, as above, a set of atoms for each dimension has been determined. Also, an appropriate atom index for each dimension of the particular function log g(·) has been determined. Denote the list of atom indices, which are determined once for all time by the parameters associated with g(·), by i₀, i₁, . . . i_(d−1). Then the following results:

log g(ν)≈a ₀ _(i0) (ν₀)+a ₁ _(i1) (ν₁)+ . . . +a _(d−1) _(id) (ν_(d−1)),  (13)

[0080] where all the atom values have been precomputed, in the atom value computation step, and can be determined by lookup in a table. Thus the approximate computation of {log g_(j)(ν)| for j=1, . . . , M} can be reduced to the steps of (1) computing all the atom values on ν, and (2) summing the appropriate d atoms for each desired Gaussian. This approximation technique is known as the method of quantized Gaussians.

[0081] 3.2 Ranking of Mixture Models

[0082] This discussion has shown how to determine an accurate approximation to log g(ν). Recall that the aim is to find the top-ranking K members of P={P(ν|l)}, where each P(ν|l) is a mixture of Gaussians, as in Equation (1). To get to this ultimate result, one more approximation is used: assume that, to identify the top-ranking K members of P, it suffices to identify the top-ranking K products w_(j)g_(j)(ν), and then select the leaves that they are assimilated to by Equation (1).

[0083] To do this, in turn it suffices to rank the kernels by log(w_(j)g_(j)(ν))=log w_(j)+log g_(j)(ν). Note that the w_(j) are constants, and hence to incorporate it into the computation, the constant log w_(j) is associated with the kernel g_(j), and this constant is added to the approximated kernel value g_(j)(ν) before the final ranking takes place. Thus Equation (13) may be revised to

log w _(j) g(ν)≈log w _(j) +a ₀ _(i0) (ν₀)+ . . . +a _(d−1) _(id−1) (ν_(d−1)).  (14)

[0084] In fact, the SLA hardware design example below assumes that the log w_(j) term is accumulated by the main processor into the result of Equation (13) that emerges from the SLA. But in principle the accumulation of this summand could be performed in the SLA as well.

[0085] 4. Apparatus Examples

[0086] This section describes a number of exemplary devices for determining the calculations disclosed in Section 3 above.

[0087] 4.1 Basic Functional Elements

[0088] Suppose, as above, that there are eight Gaussians, each one 10-dimensional, and that there are but two atoms per dimension. To describe the operation of an approximation scheme in full, three tables are used. One table gives the association of atoms to particular Gaussians. A second table gives the values of the atoms for the particular frame in question. A third table contains the accumulated sums, corresponding to the log Gaussians.

[0089]FIG. 4 shows a memory 400 having an example of all three tables. The first table, which gives the association of atoms to particular Gaussians, is implemented as indirect memory 410. The second table, which gives the values of the atoms for the particular frame in question, is implemented as atom value memory 420. The third table, which contains the accumulated sums corresponding to the log Gaussians, is implemented as accumulator 430.

[0090] It should now be clear how to obtain the (approximation) of any given Gaussian: run down the column of atom indices associated with the selected Gaussian, and use these indices to select summands from the atom value table. The accumulated value of the summands, to a good approximation, is the logarithm of the desired Gaussian. The SLA implements these memories in hardware, with appropriate data path and control elements to carry out the computation just described.

[0091] An example helps to illustrate the usefulness of memory 400. The indirect memory 410 has, for each element, a “0” or a “1.” These numbers select the particular atom, a₀(ν) or a₁(ν), respectively, associated with each atom index for a selected Gaussian. Each row of indirect memory 410 and atom value memory 420 correspond to a dimension. As an illustration, to determine the accumulated value of 6.93 for log(g₈), the following equation is used: −0.01+−1.02+1.44+−1.20+2.28+−1.36+1.73+2.61+−0.94+3.40=6.93. In the latter equation, “−0.01,” for example, is the dimension zero entry of the a₀(ν) atom.

[0092] A number of observations may now be made. First, it is being assumed that the same fixed number of atoms is used to represent each dimension of the model, where by “model” it is meant the complete collection of all Gaussians. This fixed number of atoms is denoted A. Then the entries in the indirect table must each be r=┌log₂A┐ bits wide. This width is fixed once for all time when the design is committed to hardware. This would seem to put a strict upper bound on the number of atoms per dimension. Second, the same applies to the overall dimensions (that is, the number of rows and columns) of the indirect memory and the accumulator, and this would seem to put a strict upper bound on the number of dimensions associated to a single Gaussian. In fact, neither of these limits is strict, and these points are discussed below in Sections 5.1 and 5.2.

[0093] Third, observe that, for the model as a whole, the association between a Gaussian and its atoms is fixed, once for all time, when the A distinct representative pairs <μ, σ> are chosen for each dimension of the space being modeled. As each new observation vector is acquired from the audio stream, only the atom values need to be recomputed. The indirect table need not change, unless it is desired to compute approximate values of a different collection of Gaussians (or process a larger number of dimensions, as detailed below).

[0094] 4.2 Design Details

[0095] In this section, exemplary designs of hardware are discussed in greater detail. FIG. 5 illustrates an SLA 500. There are six basic functional elements of the SLA 500. These are respectively (1) indirect memory 510, (2) atom value memory 520, (3) adder circuitry 530, (4) accumulator 540, (5) load/accumulate multiplexer (mux) 550, and (6) control unit 560. FIG. 5 depicts the data flow between these elements and various details of their sizes.

[0096] The control unit 560 is connected to all the other functional elements, and the indirect memory 510, atom value memory 520, and accumulator 540 are all connected to a suitable system bus (not shown), which interfaces to main system memory (not shown). This is shown in more detail below.

[0097] As in FIG. 4, indirect memory 510 comprises rows of atom indices related to particular dimensions and columns of atom indices related to particular Gaussians. For example, row 511 comprises atom indices related to the first dimension (i.e., “dimension zero”) and column 512 comprises atom indices related to the first Gaussian (i.e., “Gaussian zero”). Atom value memory 520, as in FIG. 4, comprises rows of atom values related to dimensions and columns of atom values related to atoms. For instance, row 521 comprises atom values related to dimension zero, while column 522 comprises atom values related to the first set of atoms (atom zero).

[0098] Basically, indirect memory 510 is used for each Gaussian to determine which atom should be used to calculate the logarithm of that Gaussian. The appropriate value, in atom value memory 520 is added by adder 530. Accumulator 540 acts to accumulate single logarithm values or hold multiple logarithm values or both, depending on the design of adder 530. Several designs of adder 530 are discussed below.

[0099] Load/accumulate mux 550 allows the accumulator 540 to accumulate zero or forces the accumulator 540 to accumulate the result of the adder circuitry 530. FIG. 6 lists the meanings of the variables and expressions used in FIG. 5, and also lists values of the variables for common speech recognition systems.

[0100] The key variables that may be changed to obtain different designs are the degree of parallelism exhibited in the indirect memory 510 or atom value memory 520 units, and the architecture of the adder circuitry 530. There are a number of different architectures for SLA 530. Three particular architectures will now be discussed.

[0101] As drawn, the architecture 530 shows d-fold parallelism in the two memories (i.e., indirect memory 510 and atom value memory 520). Thus, in principle, the adder circuitry 530 could comprise a pipelined tree of adders, computing └d/2┘ sums in parallel in a first stage, └d/4┘ sums in parallel in a second stage, and so on until the desired result is obtained in ┌log₂d┐ stages, with a final stage, if needed, to add the sum of atoms into the Accumulator. The term └d/2┘ is the largest integer less than d/2. For example, if there are ten dimensions, then there are four sums computed in the first stage. The final stage will be needed only if d is an integral power of two. In all other cases an earlier stage of the adder tree may be used to incorporate the previously accumulated value into the final sum. This architecture is depicted in FIG. 7.

[0102]FIG. 7 shows adder circuitry 530 that is an adder tree comprised of stage one through stage log₂(d) and ending in the final stage. Each stage comprises a number of adders 710 and a number of registers 720. For instance, stage one comprises d/2 adders 710 and the same number of registers 720. As discussed previously, if d is an integral power of two, the final stage is not needed. For example, if d=8, the first stage will comprise four adders 710 and four registers 720, which produce the result 0+1 (i.e., the result from the addition of the dimension zero atom value, abbreviated as “0,” and the dimension one atom value, abbreviated as “1”), 2+3 (i.e., addition of the dimension two atom value and the dimension three atom value), 4+5, and 6+7. The second stage produces the result of 0+1+2+3 and 4+5+6+7. The third stage (log₂(8)=3) produces the result of 0+1+2+3+4+5+6+7. The fourth, and final, stage sums the result of 0+1+2+3+4+5+6+7 with the output of load/accumulate mux 550.

[0103] There are a variety of techniques for handling the condition where d is not an integral power of two. In the example of FIG. 7, the values that are calculated in one complete operation of adder circuitry 530 could be added to the accumulator and then added to the values that that are calculated in the second complete operation of adder circuitry 530.

[0104] For example, assume that the variable values shown in FIG. 6 (i.e., there are 40 dimensions and each atom value is represented by 32 bits) are being used. The adder circuitry 530 then comprises five stages and a final stage. The accumulator is first zeroed. The first 32 dimensions are then calculated and accumulated into the accumulator. Load/accumulate mux 550, in this example, passes 32 bits from the accumulator to the adder 710 of the final stage. The adder circuitry 530 is then used to add the other eight dimensions, setting the 26 dimensions to zero if necessary. During the final stage, the accumulated value of the 32 dimensions is added to the newly created output of the fifth stage, thereby creating the final answer for the 40 dimensions. It should be noted that calculation of the result for 40 dimensions, with proper clock and data management, may be performed in a single cycle longer than that required to calculate the result for 32 dimensions.

[0105] Another technique for handling the condition where d is not an integral power of two is to modify adder circuitry 530 with additional adders 710 and registers 720, and thereby determine the entire d-dimensional result at once. This would, in essence, remove the need for load/accumulate mux 550. However, with load/accumulate mux 550, additional dimensions may be added to the currently existing number of dimensions in a way that is faster and involves less circuitry. Without mux 550, the previous example, involving the 32 dimension adder circuitry 520 that is used to calculate a result for 40 dimensions, would be harder to perform. The result of the first 32 dimensions would have to be added to the result of the final eight dimensions, but there is no relatively easy way to do this if there is no mux 550. Thus, mux 550 makes it easier to handle calculations for larger dimensions than for what adder circuitry 530 was originally designed.

[0106] It is also possible to implement the adder circuitry 530 as a pipelined chain of d adders, with operands emerging from the atom value memory 520 in an appropriately time-staggered fashion to feed this chain. This architecture is depicted in the series of FIGS. 8 through 13.

[0107]FIG. 8 shows a single link 800 of a pipelined adder chain (which will be discussed in reference to FIGS. 9 through 13). Single link 800 comprises an index 810, a portion of an atom value memory 820, an atom value 830, an adder 840, and a register 850. Single link 800 basically works as follows. Index 810 is transmitted from an indirect memory, and the index 810 selects one of the A atom values in atom value memory 820, which is output as atom value 830. This atom value 830 is added to the partially accumulated log-likelihood from a previous stage (as shown in FIG. 9) by adder 840. The result is stored in register 850, and the result will be added to another atom value in the next stage (as shown in FIG. 9).

[0108]FIG. 9 illustrates an SLA 900. SLA 900 comprises d single links 800, which are indicated as 800-0 through 800-(d−1), indirect memory 910, and accumulator memory 920. Each single link 800 corresponds to one dimension. In this example, there is no load/accumulate mux, although one could easily be added. The variables in FIG. 9 have been described in reference to FIG. 6. Basically, SLA 900 operates as shown in FIGS. 10 through 13. For simplicity, in FIGS. 10 through 13, N_(g) is set to eight and d is set to eight.

[0109]FIG. 10 shows an initial state of SLA 900. Indirect memory 910 comprises eight banks of memory, each containing eight (i.e., N_(g)) atom indexes 1000 through 1070. Each atom index in a bank (i.e., a column) corresponds to one of eight Gaussians. Each row of indirect memory 910 therefore corresponds to a single Gaussian having eight (i.e., d) dimensions and eight atom indexes. Initially, the indirect memory 910 is loaded as shown in FIG. 10.

[0110]FIG. 11 shows SLA 910 after a single clock cycle. The atom index 1010-0 is now in index 810-0, which is driving the address lines for atom value memory 820-0 for dimension zero. Each atom index 1010-0 through 1070-0 has been moved up one location. Although not shown in the figure, another atom index would likely be moved into the position previously occupied by atom index 1070-0.

[0111]FIG. 12 shows SLA 910 after two clock cycles. The atom value 830-0 now corresponds to the atom value determined by atom index 1010-0. Atom index 1010-1 is now in index 810-0, which is driving the address lines for atom value memory 820-0 to select an appropriate atom value from this memory. Additionally, atom index 1000-1 is now in index 810-1 and is driving the address lines for atom value memory 820-1. This combination of address lines selects an appropriate atom value from atom value memory 820-1.

[0112]FIG. 13 shows SLA 920 after three clock cycles. Atom index 1030-0 has been moved into the position shown. Atom index 1020-0 is in index 810-0, which is driving the address lines for atom value memory 820-0 to select an appropriate atom value from this memory. Atom value 830-0 corresponds to the atom value determined by atom index 1020-0. The atom value determined by atom index 1010-0 has been added to whatever value was on line 1310, and the result resides in register 850-0. Atom index 1020-1 has been moved into the position shown. Atom index 1010-1 is in index 810-1, which is driving the address lines for atom value memory 820-1 to select an appropriate atom value from this memory. Atom value 830-1 corresponds to the atom value determined by atom index 1000-1. Finally, atom index 1010-2 has been moved into the position shown. Atom index 1000-2 is in index 810-2, which is driving the address lines for atom value memory 820-2 to select an appropriate atom value from this memory.

[0113] This process continues for 10 clock cycles, after which register 850-7 will contain a value corresponding to the logarithm of the first Gaussian (i.e., Gaussian zero) in indirect memory 910. It should be noted that a single adder circuitry, such as the adder circuitry 530 of FIG. 5, can be considered to be adders 840 and registers 850 of FIGS. 10 through 13.

[0114] The previous two designs, while possible and appealing under various considerations of cost, latency and throughput, utilize too much chip area for an add-on to a low-cost microprocessor core. The design depicted in FIG. 14 is more suitable for a low-cost microprocessor core. FIG. 14 illustrations a portion 1400 of an SLA. Portion 1400 comprises, as in FIG. 5, adder circuitry 530, an accumulator 540, and a load/accumulate mux 550. Adder circuitry 530 comprises two adders 140 and 1420. Accumulator 540 comprises a de-multiplexer (demux) 1430, a mux 1440, and a number of registers, of which register 1450 is shown. Portion 1400 basically operates as follows.

[0115] Two atom values for two dimensions (for instance, dimensions zero and one) are added by adder 1410 to create result 1415. The load/accumulate mux 550 is configured to input zero. Adder 1420 then adds the result 1415 to the output 1425 of mux 550. The demux 1430 is configured to select one of the registers. The register currently selected is register 1450. The mux 1440 is also configured to select this register. Thus, in the current example, register 1450 contains the sum 0+1 (i.e., the atom value for dimension zero, added to the atom value for dimension one). Then, two more atom values for the next two dimensions (for instance dimensions 2 and 3) are added by adder 140, so that result 1415 contains the sum 2+3. Mux 550 is configured to select the output of mux 1440. Consequently, adder 1420 then produces the sum (0+1)+(2+3), which is then stored in register 1450. This process continues for all dimensions, whereupon another register is selected by demux 1430 and mux 1440.

[0116] Hence, only two operands emerge from the atom value memory in any given cycle of operation. These two operands are summed, and the result is accumulated into the appropriate element of the accumulator. This approach has the advantage that it devotes minimal silicon to the arithmetic data path, and yet is efficient enough to achieve the desired hardware performance goals.

[0117] Note, however, that if greater efficiency is desired, one of the alternative designs described above may be employed to exploit the large degree of latent parallelism available in the mathematical Equation (13) of the present technique.

[0118] In FIG. 15, an exemplary SLA 1500 is shown, which incorporates the portion 1400 of FIG. 14 and which is used for 10-dimensional operations. The values in FIG. 4 are used for all values other than d. SLA 1500 comprises indirect memory 510, atom value memory 520, adder circuitry 530, accumulator 540, and mux 550. As in FIG. 14, adder circuitry 530 comprises two adders 1410 and 1420. Atom value memory 520 is separated into ten sections 1510, each section 1510 having 64 atom values for a particular dimension, each atom being stored in 32 bits. The indirect memory 510 similarly is separated into 10 indexes 1520, each of which indexes 32 Gaussians for one dimension, which makes each index 1520 32×64 bits in size. Accumulator 540 has a size of 640×32 bits.

[0119] There are several ways for this SLA 1500 to operate. In one exemplary way, the indirect memory 510 puts the addresses indicated by indexes 1520-0 and 1520-1 on buses 1530 and 1540, respectively, while enabling sections 1510-0 and 1510-1. This allows each bus 1530, 1540 to use 6 bits. The atom values in these sections 1510-0 and 1510-1 will be placed on buses 1550 and 1560, respectively. Each bus 1550, 1560 is 32 bits. These values are added by adder 1410, as described previously. The indirect memory 510 continues to place addresses defined by indexes 1520-2 and 1520-3, then 1520-4 and 1520-5, and so forth, until the computation is complete. Another way for this to operate is without the use of enable signals, but this requires more address bits and consequently more space to store atom indexes.

[0120] It is noted as well that there is freedom in the sizes of the various memories. For practical reasons, it is beneficial to choose the value d=10 for a design of an SLA, particularly because many typical speech recognition systems have 40 or more dimensions. Let D be the true number of model dimensions. The mismatch between the assumed number of dimensions d and the true number of dimensions D can be got round using the methods described immediately below, in Section 5.1. However, these methods force the SLA to consume more bandwidth to main memory, than if d were chosen equal to D.

[0121] 5 Extensions and Refinements

[0122] In this section, various extensions and refinements of the basic scheme described above are considered. Techniques are discussed for handling high dimensional models, handling more atoms per dimension, performing hierarchical labeling, and handling functions that are not completely separable, in the sense defined in Section 2.2.

[0123] 5.1 Handling More Dimensions

[0124] To handle more than d dimensions, it suffices to observe that the decomposition of Equation (13) can be extended as $\begin{matrix} {{\log \quad {g(v)}} \approx {\left( {{a_{0_{i_{0}}}\left( v_{0} \right)} + {a_{1_{i_{1}}}\left( v_{1} \right)} + \cdots + {a_{d - 1_{i_{d - 1}}}\left( v_{d - 1} \right)}} \right) + \left( {{a_{d_{i_{d}}}\left( v_{d} \right)} + {a_{d + {1i_{d + 1}}}\left( v_{d + 1} \right)} + \cdots + {a_{{2d} - {1i_{{2d} - 1}}}\left( v_{{2d} - 1} \right)}} \right) + \cdots}} & (15) \end{matrix}$

[0125] Recall that the SLA, in one invocation, effectively computes one complete row of summations, as expressed in Equation (15) just above. Thus a calculation may proceed by accumulating over blocks of d dimensions at a time, providing that the accumulator is not cleared after each invocation of the SLA. Note that, in general, from one block to the next, both the atom value memory and the indirect memory must be reloaded. One possible exception to this occurs when performing hierarchical labeling, as described below.

[0126] For clarity, the following is an algorithm for processing a model comprising a number D=kd dimensions, where k is an integer greater than one. Note that if D is not an integral multiple of k, it can effectively be made into one by extending the model with unused dimensions, and entering all zeros into the elements of atom value memory that correspond to the dummy dimensions. Accumulating sums over the dummy atoms has no effect upon the final result. The algorithm is shown as method 1600 of FIG. 16. Method 1600 is used to process more dimensions than an implementation of an SLA was originally designed to process.

[0127] In step 1610, the values of all atoms for the current observation vector, ν, are computed. In step 1620, the value j is set to zero (i.e., j←0). In step 1630, the indirect memory and atom value memory are loaded with their values for dimensions jd,jd+1, . . . , (j+1)d−1.

[0128] In step 1640, the SLA is operated using the current (just-loaded) entries of the indirect memory and atom value memory. If j=0, and for the first two dimensions processed, set the load/accumulate mux to load. If j>0, and for every other dimension pair, set the load/accumulate mux to accumulate.

[0129] In step 1650, set j←j+1. If j=k, i.e., step 1660=YES, the computation is complete, and the desired values may be extracted from the accumulator. Otherwise (step 1660=NO), j<k. Continue at step 1630 above with the next block of d dimensions.

[0130] Note that the computation of atom values associated with dimensions jd,jd+1, . . . , (j+1)d−1, for j>0, may be overlapped with the operation of the SLA, when the SLA is processing dimensions j′d,j′d+1, . . . , (j′+1)d−1 with j′<j. This additional opportunity for parallelism may be easily exploited.

[0131] 5.2 Handling More Atoms per Dimension

[0132] In this section, the issue of handling a larger number of atoms per dimension is addressed. This mode of operation is called the “many atom mode.”

[0133] As explained above, the atom value memory is configured for some fixed number A atoms per dimension. Typically, for optimal use of the k bits of atom index that can be stored in each entry of the indirect memory, A is an integral power of 2, that is A=2_(k) for the integer k. It is now shown how this architecture may be exploited for efficient computation of any number A′=m·(A−1) atoms per dimension, where m>1.

[0134] Let the A′ distinct atoms be divided into m stanzas of A−1 atoms each. To each stanza, in each dimension, one null atom value is joined. This is an atom with numerical value 0, so that accumulating it into the full sum for a particular Gaussian has no effect on the outcome.

[0135] Now many atom mode is explained. Recall that in normal operation (that is to say, only A atoms per dimension), after running through the d dimensions of atom indices and atom values for a given set of Gaussians, the accumulator contains the collection of log Gaussian values. These are then transferred back to main memory, and the accumulator is cleared before restarting the computation for a new set of Gaussians, or a new observation vector. However, when operating in many atom mode, rather than effecting the transfer of the accumulator contents back to main memory, and thereafter clearing the accumulator, the accelerator simply continues processing through one stanza after another, never clearing the accumulator. This permits any of the A−1 atoms in any of the m distinct stanzas to be the one selected for accumulation for a particular Gaussian.

[0136] The only difficulty with this mode of operation is that the design of the accelerator is such that whenever processing a given stanza, some atom value should be selected for accumulation into each log Gaussian represented in the accumulator. This then is the purpose of the null atom value: to permit the depositing of an index (corresponding to the null atom) into the indirect memory for a given stanza, such that if the atom desired for a given Gaussian and dimension does not appear in that stanza, an accumulation may nevertheless be specified for the stanza that has no effect upon the accumulator entry associated to the given Gaussian.

[0137] To make this more clear, suppose the stanzas are numbered 0, 1, . . . , m−1, and consider a particular Gaussian g, and a particular dimension r. Suppose that the null atom has index 0 in each stanza, and that for the given Gaussian g and dimension r, the associated atom is index i (with 1≦i≦A−1) in stanza s (with 0≦s≦m−1). Then for any stanza except stanza s, atom index 0 is recorded for Gaussian g, dimension r. In stanza s however, the index i is recorded for the given Gaussian and dimension.

[0138] An example of a system using the many atom mode is shown in FIG. 1700. FIG. 17 illustrates an exemplary system 1700 for handling more dimensions than an SLA was originally designed for. System 1700 comprises indirect memory 510, atom value memory 520, and main memory 1760. Main memory 1760 is connected to indirect memory 510 and atom value memory 520 through bus 1750. As before, indirect memory 510 is a number of Gaussians wide (N_(g)) and d dimensions deep. Also as before, atom value memory 520 is A atoms wide and d dimensions deep. Main memory comprises atom value memory copies 1730-1, 1730-2 and atom value memory copies 1740-1, 1740-2. Atom value memory copies 1730-1, 1730-2 are N_(g) units wide and d dimensions deep. Atom value memory copies 1740-1, 1740-2 are (A−1)b bits wide and d dimensions deep.

[0139] In this example, column 1710 is filled with zeros. This means that any index in indirect memory 510 having an address that selects an element from column 1710 will add a zero to the current calculation. There are (A−1) columns 1720. First, the accumulator (not shown) is zeroed. Initially, indirect memory 510 is loaded with indirect memory copy 1730-1 and the (A−1) columns 1720 of atom value memory 520 are loaded with the atom value memory copy 1740-1. The appropriate calculations are performed. Then, indirect memory 510 is loaded with indirect memory copy 1730-2 and the (A−1) columns 1720 of atom value memory 520 are loaded with the atom value memory copy 1740-2. Another set of calculations are performed. During the two sets of calculations, the accumulator accumulates. After the two sets of calculations, the results are removed from the accumulator.

[0140] It should be noted that FIG. 17 represents only one technique for performing the many atom mode. Those skilled in the art will be able to identify other techniques for performing the many atom mode. For example, the indirect memory copy 1730-1 could comprise an additional bit for each of the N_(g) units. This bit could be used to determine whether the atom for a particular Gaussian resides in atom value memory copy 1760-1 or 1760-2. A controller (not shown), such as control unit 560 of FIG. 5, could examine this bit and either load the address into memory 510 to select an atom from column 1710 or load the address to select an atom from one of the columns 1720. Additionally, it should be noted that adding columns of zeros to atom value memory copies 1740 allows any number of atoms to be used in these calculations. Moreover, atom value memory copies 1740-1 and 1740-2 could be A units wide and designed with their first columns (or any other column) defined as column 1710 is defined.

[0141] 5.3 Hierarchical Labeling

[0142] As mentioned above, it is desirable to avoid computing even the approximate value of every Gaussian in the model M. For this reason, the set of all Gaussians is organized into a tree, with each Gaussian in the model appearing at the bottom level of the tree. Note that this tree is not the decision tree mentioned briefly above, which occasions the nomenclature “leaf” for the mixture-of-Gaussian models ultimately computed. Organizing Gaussians into a tree is commonly called “hierarchical labeling.” The latter is described in more detail in U.S. Pat. No. 6,023,673, entitled “Hierarchical Labeler in a Speech Recognition System,” issued date Feb. 8, 2000, the disclosure of which is incorporated herein by reference.

[0143] At the top of the tree, some number L₁ of Gaussians are found, at the next level L₂ Gaussians with L₁<L₂, and so on for each succeeding level, with L_(i) Gaussians at the ith level, and L_(i)<L_(i÷1). To each Gaussian g(·) at level i are assimilated some children h₁(·), h₂(·), . . . h_(n) _(g) (·) at level i+1, where n_(g) is the number of children of Gaussian g.

[0144] Recall that ultimately, only the K highest-ranking Gaussians are desired from the complete set of Gaussians that comprise the model M. The objective of the hierarchical organization is to provide a structure for exploring only those sections of the tree that are likely to yield a high-ranking Gaussian at the bottom level. While the techniques for constructing the tree are not described here, it is designed with the following property: if a Gaussian g at level i−1 has high likelihood, then it is probable that one of the K highest-ranking Gaussians, at the bottom level, lies in the subtree that depends from g.

[0145] Thus, when operating an SLA that uses hierarchical labeling, the method 1800 shown in FIG. 18 is used. Method 1800 is as follows.

[0146] In step 1810, the values of all atoms for the current observation vector, ν, are computed. Note that the same set of atoms is generally used for all levels of the tree.

[0147] Begin at level i=1 (step 1820). Place all Gaussians at this level into the set s_(i), which is the set of all searchable Gaussians at level i. In step 1830, using the SLA hardware, the current atom values, and appropriate values for the indirect memory, compute the (approximate) value of each Gaussian g ε s_(i). Note that this computation proceeds only over the set S_(i) at level i.

[0148] If i is the final level of the tree (step 1840=YES), select the K highest ranking Gaussians from those just computed, and use these to determine the K highest ranking leaves. The computation is now complete (step 1850).

[0149] Otherwise, i is not the final level of the tree. Set S_(i+1)←Ø (step 1860). In step 1870, determine which Gaussians gεs_(i) are selected for expansion. For instance, a g may be selected for expansion if it is sufficiently high-ranking in likelihood among those in S_(i), or if its likelihood is within some predetermined factor of g*(ν), where this is defined to be the highest-ranking element of S_(i). For all g selected for expansion, by whatever criterion, let S_(i+1)←S_(i+1)∪{h₁, . . . , h_(n) _(g) }, where h₁, . . . , h_(n) _(g) are the children of g.

[0150] Set i←i+1 (step 1880). Go to step 1830 above.

[0151] In a typical tree built to implement this algorithm, the tree has three levels, with L₁=128, L₂=2048, and L_(3≈)10000. Thus the fan-out from level 1 to level 2 is about 16, which is to say on average each level 1 Gaussian has 16 children. Likewise, the fan-out from level 2 to level 3 is about 5. As noted above, the algorithm begins by selecting all level 1 Gaussians for expansion. Thereafter, typically about 3×128=384 Gaussians are evaluated at level 2, and about 5×128=640 Gaussians are evaluated at level 3. It is this latter number that drove the recommended design decision T_(g)=640, as in FIG. 6 above. Note, however, that, while these values are typical, including the number of levels, they are not requirements.

[0152] Earlier, the opportunity was mentioned that, under special circumstances, the system could avoid reloading the atom value memory after processing each block of d dimensions. These special circumstances are now explained.

[0153] In the process of performing hierarchical labeling, consider the move from level L_(i) to level L_(i+1), and recall that the atoms used in any particular block of dimensions are the same for every level of the hierarchy. Suppose (as is typical) that the model in question has some number of dimensions D, with D=kd for some k>1. As described in Section 5.1, some provisions must be made for processing blocks of d dimensions in succession.

[0154] Observe though that the order in which blocks are processed is completely arbitrary, as addition is nominally commutative. Suppose then that at level i, the system has just finished processing the very last block of dimensions, that is from dimension (k−d)d through kd−1, inclusive. The atoms appropriate to this block of dimensions therefore reside in the atom value memory. Thus, a system can avoid loading this set of atom values again, if the computation is initiated at level i+1 with this same block of dimensions.

[0155] Indeed, the system may then work downward through blocks of dimensions in level i+1, ending with dimensions numbered 0 through d−1. Then, in advancing to level ii+2, the system may initiate that computation at the low end of dimensions, thereby saving a reload of the atom values associated with those dimensions. This zig-zag through blocks of dimensions may be used throughout the traversal of succeeding levels of the tree, and is in fact implemented directly in hardware.

[0156] This is more easily explained with reference to a figure. Turning now to FIG. 19, a system 1900 is shown comprising a processor core 1910, an SLA 1950, and a main memory 1760, all interconnected through bus 1948. FIG. 19 is used mainly to illustrate a sequence of steps that are performed, and which device performs which step. Processor core 1910 comprises steps 1905 through 1935. SLA 1950 comprises three steps 1960 through 1980. As before, main memory 1760 comprises atom value memory copies 1940-1 and 1940-2. The sequence of steps that will now be described is merely exemplary, and the sequence should not be construed to be limiting.

[0157] Assume that there are 20 dimensions, and the SLA 1950 is designed for 10 dimensions; also assume that there are 64 atoms per dimension and that the SLA 1950 is designed for 64 atoms per dimension. Cepstrum computation 1905 is performed first. Next, atom value computation 1910 is performed. Step 1910 creates two sets of atom values, each set having 10 dimensions. Atom value memory copy 1940-1 contains atom values for the first 10 dimensions (i.e., dimensions 0 through 9), while atom value memory copy 1940-2 contains atom values for the next 10 dimensions (i.e., dimensions 10 through 19). In step 1920, additional Gaussians, from the first level, are selected for evaluation. The SLA performs step 1960, which performs a level one density computation, as previously described. The processor core 1910 then selects some of the Gaussians for the next level (step 1925), and SLA 1950 performs a level two density computation in step 1970. Again, more Gaussians are selected (step 1930 by processor core 1910), this time from the last level, and SLA 1950 performs a level 3 density computation in step 1980. The processor core 1910 performs step 1935, where it performs a final selection and rank mapping. In FIG. 19, lines 1985 indicated the flow of operations, while lines 1990 indicate the “zig-zag” that occurs with atom value memory copies 1940-1 and 1940-2.

[0158] The zig-zag method works as follows. When SLA 1950 performs step 1960, main memory 1760 loads the atom value memory copy 1940-1 into the atom value memory 520 and performs calculations for the first set of dimensions. Then, SLA 1950 loads the atom value memory copy 1940-2 into the atom value memory 520 and performs calculations for the second set of dimensions. When SLA 1950 performs step 1970, the atom value memory copy 1940-2 is already loaded into the atom value memory 520. Consequently, the level two density computation 1970 proceeds backwards, in that atom value memory copy 1940-2 is used first for calculations for the second set of dimensions. Then, atom value memory copy 1940-1 is loaded into atom value memory 520 and used for calculations for the first set of dimensions. When level three density computation 1980 is performed, it again proceeds forwards, in that atom value memory copy 1940-1 is used first for calculations for the first set of dimensions. Then, atom value memory copy 1940-1 is loaded into atom value memory 520 and used for calculations for the second set of dimensions. Lines 1990 indicate the “zig-zag” that occurs.

[0159] 5.4 Partial Separability

[0160] In this section, the example of the Gaussian is returned to, and it is shown how the invention may be applied even when the function ƒ(ν) is not completely separable. For the purposes of exposition, consider the case when the Gaussian g(ν) has a covariance matrix Σ that is 2×2 block diagonal, thus $\begin{matrix} {\sum{= \begin{bmatrix} \sigma_{11}^{2} & \sigma_{12} & \quad & \quad & \quad \\ \sigma_{21} & \sigma_{22}^{2} & \quad & \quad & \quad \\ \quad & \quad & \sigma_{33}^{2} & \sigma_{34} & \quad \\ \quad & \quad & \sigma_{43} & \sigma_{44}^{2} & \quad \\ \quad & \quad & \quad & \quad & ⋰ \end{bmatrix}}} & (16) \end{matrix}$

[0161] The following can be written: Σ₁₂ for the submatrix in rows 1, 2 and columns 1, 2; Σ₃₄ for the submatrix in rows 3, 4 and columns 3, 4; and so on. Then, by a straightforward computation, $\begin{matrix} \begin{matrix} {{\log \quad {g(v)}} = \quad {{{- \frac{1}{2}}\left( {v_{12} - \mu_{12}} \right)^{T}{\underset{12}{\sum\limits^{- 1}}\left( {v_{12} - \mu_{12}} \right)}} - {\log \left( {2\pi {\sum\limits_{12}}^{1/2}} \right)}}} \\ {\quad {{{- \frac{1}{2}}\left( {v_{34} - \mu_{34}} \right)^{T}{\underset{34}{\sum\limits^{- 1}}\left( {v_{34} - \mu_{34}} \right)}} - {\log \left( {2\pi {\sum\limits_{34}}^{1/2}} \right)}}} \\ {\quad {{{- \frac{1}{2}}\left( {v_{d - 1_{d}} - \mu_{d - 1_{d}}} \right)^{T}{\underset{d - 1_{d}}{\sum\limits^{- 1}}\left( {v_{d - 1_{d}} - \mu_{d - 1_{d}}} \right)}} - {\log \left( {2\pi {\sum\limits_{d - 1_{d}}}^{1/2}} \right)}}} \end{matrix} & (17) \end{matrix}$

[0162] where ν_(i−1) _(l) is a two-element column vector consisting of elements i−1 and i of ν, and likewise for μ_(i−1) _(i) . Thus a partial decomposition of log g(ν) into ┌d/2┐ functions is $\begin{matrix} {{f_{i - 1_{i}}\left( {v_{i - 1},v_{i}} \right)} = {{{- \frac{1}{2}}\left( {v_{i - 1_{i}} - \mu_{i - 1_{i}}} \right)^{T}{\underset{i - 1_{i}}{\sum\limits^{- 1}}\left( {v_{i - 1_{i}} - \mu_{i - 1_{i}}} \right)}} - {\log \left( {2\pi {\sum\limits_{i - 1_{i}}}^{1/2}} \right)}}} & (18) \end{matrix}$

[0163] Providing then that it is possible to find a suitable collection of atoms for the family of functions {ƒ_(j,i−1) _(l) (ν_(i−1), ν_(i))}_(j=1) ^(M), then one may apply exactly the same hardware to approximating log g(ν), even when this log kernel is only partially separable. This method is of course generalizable to an arbitrary pdf that is partially separable. Gaussians were chosen here purely for expository reasons.

[0164] In fact, a scheme similar to the one presented above, which uses splitting functions of two observation vector elements, has actually been implemented within some speech recognition systems. This method is referred to as “dual band quantization.” It should be noted though that the implementation uses purely diagonal matrices, that is, each 2×2 block is itself diagonal. The dual band approach is used just to save memory and processing time.

[0165] It is worth noting that the elements of ν may be permuted at will to bring them to an order that permits the desired characteristic of partial separability to be exhibited. Likewise, there is nothing special about 2×2 block-diagonal covariance matrices. Indeed, the technique illustrated here may be applied for instance with varying numbers of arguments to the different splitting functions. For instance, in a 6-dimensional space, one might write

ƒ(ν)=ƒ _(i)(ν₁)+ƒ₂(ν₂, ν₃)+ƒ₃(ν₄, ν₅, ν₆)  (19)

[0166] if the structure of the original collection of kernels {g_(j)(ν)}_(j=1) ^(M) so dictate.

[0167] 5.5 Other Kernel Expressions

[0168] Note that a given splitting function may have a complicated structure. For instance, it may itself be a mixture of Gaussians. That is, one might in principle have

ƒ_(i)(ν_(i))=w _(i) g _(i)(ν_(i))+w ₂ g ₂(ν_(i))+ . . . w _(N) g _(N)(ν_(i)),  (20)

[0169] where each gk(ν_(i)) is a univariate Gaussian. Such a technique, known as the compound Gaussian method, is the subject of a U.S. patent application Ser. No. 09/566,092, entitled “High-Dimensional Acoustic Modeling via Mixtures of Compound Gaussians and Linear Transformations,” by Chen et al., filed May 5, 2000, the disclosure of which is incorporated herein by reference. Indeed, the more complicated each splitting function is, the more appropriate it is to use the representation and computation scheme described above. One difficulty in applying this technique is finding a suitable collection of atoms.

[0170] 5.6 Application to Non-Gaussian Probability Density Functions

[0171] Although the discussion until now has focused on Gaussian pdfs, the present invention is equally suitable for non-Gaussian pdfs. The present discussion has focused on Gaussian pdfs because these pdfs are commonly used in speech recognition and for simplicity of exposition. However, there are systems that use other pdfs. One such system is described in Ney, “Experiments on Mixture-Density Phoneme-Modeling for the Speaker-independent 1000-word Speech Recognition DARPA Task,” IEEE Conf. on Acoustics, Speech, and Signal Processing, vol. 2, 713-716 (1990), the disclosure of which is incorporated herein by reference. This reference discusses the use of Laplacian densities but does no comparison between Laplacians and Gaussians. A second system, which describes what are called “alpha-stable densities,” is Basu et al., “Maximum Likelihood Estimates for Exponential type density Families,” IEEE Conf. on Acoustics, Speech, and Signal Processing, vol. 1, 361-364 (1999), the disclosure of which is incorporated herein by reference. Thus, the present invention is application to non-Gaussian functions as well as Gaussian functions.

[0172] 6. Practical Issues

[0173] In this section, a number of practical issues regarding the use of the SLA are addressed. In Section 6.1, the integration of the SLA with software and hardware is described. In Section 6.2, the load the SLA imposes on the bus to main memory is estimated, and it is shown that its impact is small. In Section 6.3, the area of the core is estimated, in one exemplary implementation. From this, an estimate of power consumption may be derived. In Section 6.4, the impact of the SLA on recognition accuracy is discussed. In Section 6.5, more information regarding interfaces to the SLA are described.

[0174] 6.1 Integration with Embedded Speech

[0175] Referring now to FIG. 20, a System On a Chip (SOC) 2000 is shown. SOC 2000 comprises a Central Processing Unit (CPU) core 2005, a Processor Local Bus (PLB) arbiter 2010, a PLB 2015, a memory controller 2020, an SLA 500, a Direct Memory Access (DMA) controller 2025, an On-Chip peripheral Bus (OPB) to PLB bridge 2030, an OPB arbiter 2035, an OPB 2040, an internal peripheral 2050, main memory 2060, an Extended Bus Controller (EBC) 2070, and a Device Control Register (DCR) bus 2080. Main memory 2060, in this example, comprises Static Random Access Memory (SRAM) and Read-Only Memory (ROM). However, Dynamic RAM (DRAM) may also be used.

[0176] CPU core 2005 comprises cache 2007. Optionally, cache 2007 may be separate from CPU core 2005. PLB arbiter 2010 determines which device of the CPU core 2005, memory controller 2020 and SLA 500 is allowed to control the PCB 2015. Similarly, OPB arbiter 2035 determines which device of the DMA controller 2025, bridge 2030, main memory 2060, peripheral 2050 or EBC 2070 controls OPB 2040. Memory controller 2020 controls access to memories, such as main memory 2060. It should be noted that main memory 2060 may also be placed off-chip. Internal peripheral is one of any number of devices, such as an analog-to-digital converter. EBC 2070 controls access to off-chip devices, such as memory or peripherals. DCB 2080 is used to configure on-chip devices, such as SLA 500.

[0177] System 200 shows a system 2000 where SLA 500 is built on the same silicon substrate as CPU core 2005. However, the PLB 2015 could be off-chip from the CPU core 2005, thereby allowing the SLA to be off-chip. Operation of system 2000 is discussed in more detail below, although it is relatively self-explanatory for one skilled in the art.

[0178] While the SLA implements a large share of processing associated with the labeling step, there are still some functions performed in software by CPU core 2005. Software would generally be loaded into main memory 2060. Notably, the functions recommended to be performed by software are (1) accumulating the log prior information into the weighted Gaussian computation, as expressed in Equation (14) above, and (2) sorting of Gaussians by likelihood, and selecting Gaussians for expansion at each level of the hierarchy. These steps will continue to be performed by the CPU core 2005.

[0179] In one embodiment, the SLA 500 is intended to be integrated with a speech recognition engine (i.e., loaded in main memory 2060) by means of a library, which encompasses an SLA driver. The library and SLA driver will reside in main memory 2060. By making a suitable collection of calls to subroutines in the library, a programmer may set up various control registers of the SLA 500. For instance, such calls will establish the absolute memory location of atom values, Gaussian index tables, and so on. The programmer will then start the SLA 500 by issuing what appears to be a procedure call, which returns immediately. The programmer will then have the choice of polling main memory 2060 for a flag that indicates that the SLA 500 has completed, or installing an interrupt handler to process a hardware-done interrupt set by the SLA 500. The SLA 500 replaces key elements of functions, particularly the labeling functions, of the speech recognition engine.

[0180] In this embodiment, one key point in programming the SLA 500 is that it interacts with the CPU core 2005 exclusively through main memory 2060, even though the CPU core 2005 and the SLA 500 reside on the same physical die. In particular, this means that values computed by the processor core should be flushed from cache 2007 to main memory 2060, before any main memory 2060 locations are queried by the SLA 500. Conversely, values transferred from the SLA 500 to main memory 2060 via DMA must in fact be read by the CPU core 2005 from main memory 2060, and not from the its cache 2007. Thus, the operating system (not shown) should, for this embodiment, have provisions for marking certain regions of main memory 2060 non-cacheable.

[0181] 6.2 Bus Bandwidth

[0182] Here, the question of bus bandwidth to main memory and logical connectivity with the rest of the design is discussed. This question will be approached as follows. First, determine the number of bytes transferred in one full frame of labeling, as performed by the SLA 500. Next, assume a particular frame rate, and determine the traffic imposed on the bus in bytes per second. Finally, assume a particular bus speed, and determine the fraction of available bus width consumed by the SLA 500.

[0183] This discussion begins by considering the bus traffic associated with one full frame of labeling. This traffic falls into the following three categories: atom value loading, indirect memory loading, and result retrieval. Next, traffic for each category is estimated.

[0184] 6.2.1 Atom Value Loading

[0185] Define the table of parameters shown in FIG. 21. Observe that k loads of the atom value memory are required at level one of the hierarchy, followed by k−1 loads at each succeeding level. Each load transfers b bits/atom by A atoms/dimension by d dimensions=A·d·b bits. Thus, the total number of bytes transferred in loading atoms, written B_(atom), is

B _(atom)=(k+(k−1)(H−1))·A·d·b/8  (21)

[0186] For the typical values given above, B_(atom)=25600 bytes.

[0187] 6.2.2 Indirect Memory Loading

[0188] The key parameters in this computation are shown in FIG. 22. The number of bits of index to represent a block of d dimensions is therefore r·d. Hence, the number of bytes to represent this same block of indices is ┌r·d/8┐. Thus, the total number of bytes transferred in loading the indirect memory is $\begin{matrix} {B_{index} = {k \cdot \left\lceil \frac{r \cdot d}{8} \right\rceil \cdot {G.}}} & (22) \end{matrix}$

[0189] 6.2.3 Result Retrieval

[0190] The key parameters in this calculation are shown in FIG. 23. The total number of bytes required to retrieve results from the accumulator to main memory is therefore b·G/8. However, recall that the SLA only computes Gaussian values. The main CPU is required to intercede between levels of the hierarchical computation, and determine which Gaussians will be selected for expansion. Thus, each Gaussian must be propagated twice across the main memory/processor die boundary, if the main memory is off-chip: once when written by the SLA, and again when read by the cpu. Thus the total number of bytes transferred in retrieving results is $\begin{matrix} {B_{results} = {\frac{2{bG}}{8}.}} & (23) \end{matrix}$

[0191] For the typical values given above, B_(result)=9216 bytes.

[0192] 6.2.4 Summary and Analysis

[0193] It has now been established that in one frame of SLA processing, the total number of bytes transferred over the main system bus is $\begin{matrix} \begin{matrix} {B_{frame} = \quad {B_{atom} + B_{index} + B_{result}}} \\ {= \quad {{\left( {k + {\left( {k - 1} \right)\left( {H - 1} \right)}} \right) \cdot A \cdot d \cdot {b/8}} + {k \cdot \left\lceil \frac{r \cdot d}{8} \right\rceil \cdot G} + \frac{2{bg}}{8}}} \end{matrix} & (24) \end{matrix}$

[0194] For the values given above, this yields B_(frame)=25600+36864+9216=71680 bytes/frame. Now let t_(frame) be the frame “rate,” by which is meant the time in seconds between the initiation of successive frames of processing. Then the total number of bytes transferred per second, in a continuously operating recognition system, is

B_(total)B_(frame)/t_(frame).  (25)

[0195] A typical value for t_(frame) is 15 milliseconds (ms), or 0.015 seconds (s), which yields a typical value of B_(total)=71680/0.015=4,778,667 bytes/s.

[0196] Now the average number of cycles for a 128-byte transfer on a 64-bit wide processor local bus (PLB), using a 32-bit Synchronous DRAM, is 45 cycles. Assume a 50 MHz PLB, which results in a cycle time of τ=1/(5×10⁷)=2×10⁻⁸s. Thus, the aggregate total bus bandwidth is T=128/45τ=142 million bytes/s. Therefore in typical operation, the SLA consumes about (4.78/142)×100≈3.4% of available bus bandwidth, which is a small amount.

[0197] 6.3 Area and Power Consumption

[0198] The area of one possible core is approximately 220,000 cells in International Business Machine 7SF technology (SA-27E), or about 0.9 square millimeters. From this figure, an estimate of power consumption may be deduced, by treating the power usage of the core as a fraction, according to area, of the power consumption of the processor. While this power has not been estimated, it is likely to be relatively small.

[0199] 6.4 Accuracy Improvements

[0200] So far, the discussion in this section has centered on latency and power consumption issues. Because the SLA implements the time-consuming portion of the labeling algorithm in hardware, it is possible to contemplate constructing recognition systems with much more computationally demanding acoustic models, providing they can be mapped to the SLA architecture.

[0201] One such example is the method of discriminative features, proposed by Ellen Eide of IBM Watson Research Center. In preliminary tests, the use of discriminative features reduced the sentence error rate (SER) by 25 percent to 40 percent, relative to a system without such features. This is a very substantial performance improvement.

[0202] A problem with the discriminative feature approach is that it approximately quintuples the amount of time that must be spent in the labeler, and this is prohibitive for a normal speech recognition system that performs speech recognition through software. However, the required computation maps naturally onto the SLA. Thus it would be relatively easy to implement such a system, with little or no impact on latency, on a processor that was equipped with the SLA core. For this reason, it is believed the SLA may enable the construction of speech recognition systems that are at once faster, more power efficient, and substantially more accurate.

[0203] 6.5 Another Exemplary SLA

[0204] The SLA of FIG. 20 is shown more particularly in FIG. 24. Turning now to FIG. 24, SLA 5000 comprises a DCR interface control 2410, a number of registers 2415, a PLB master control 2425, a DMA control logic 2430, an adder pipeline logic block 2345, which itself comprises indirect memory 510, atom value memory 520, adder circuitry 530, and an accumulator 540. The present discussion acts as a fairly succinct synopsis of the present invention (although this synopsis should not be construed to be limiting) and acts to describe a potential embodiment for an SLA.

[0205] In one embodiment, the SLA 500 will be used to speed up the processing required in a speech label algorithm for acoustic modeling in speech recognition. At the observation frequency (e.g., every 10 ms), the main CPU or possibly another core computes the atom values for an observation vector. The observation vector contains multiple dimensions of Atoms and consists of 64, 32-bit signed values for each dimension.

[0206] The labeler algorithm determines the best match for identification of a sound by applying high-dimensional Gaussian probability density functions to the observation vector. The application of the Gaussian probability density functions is simplified to blocks of summations of selected atom values, defined by a predefined index into each Atom dimension. The typical application implements 40 dimensions however for this core, the number of dimensions may be any multiple of 10 up to 320 dimensions. A larger number of dimensions allows for more precise labeling and identification. For the SLA 500, any form of indices may be used, not necessarily Gaussian functions. The final summation values written back to system memory by the SLA core are used by software to determine the best match or to define the next set of indices to be applied to further refine the search for the best match.

[0207] The SLA is initialized by system software to indicate the starting location of the Atom values and the starting location and size of the of the General Indirect memory that contains the indices. The CPU (not shown in FIG. 24) also writes the SLA configuration registers 2415 and linked list 2410 to indicate which blocks of indices are to be applied to the atom values to compute the sums. The CPU then writes to the SLA control register, which exists in registers 2415, to indicate that processing is required and to indicate the number of passes of 10 dimensions to perform.

[0208] As shown in FIG. 25 (with appropriate reference to FIG. 24), SLA processing generally comprises four stages. The first stage comprises loading the first 10 dimensions of the atom values into the core atom memory 520. In the second stage, 10 dimension, 16 entry blocks at a time of indices defined in the linked list 2420 are loaded into each half of the core indirect memory 510. The third stage operation is the pipelined computation of each atom sum with the result stored into the accumulator 540. The indices in the indirect memory 510 are used to select an atom value in each of the 10 dimensions to be added together to create the accumulator 240 sum. The second and third stage are repeated and overlapped until all sums described in the linked list 2420 for the first 10 dimensions have been computed and stored into the accumulator 540. If more passes are required, that is, more dimensions are required to computed the summation, the SLA will return to the first stage. Atom memory for the next 10 dimensions is loaded into the atom memory 520.

[0209] The SLA 500 starts at the top of the linked list 2420 again to load the indices for the next 10 dimensions. Stages two and three are repeated, adding the accumulator sum from the previous pass. In the forth stage, the SLA writes the accumulator 240 results to a particular starting memory address, then indicates to the CPU that the operation has completed. The CPU may then read the accumulator results from memory.

[0210] In a typical application, the summation computations will be done multiple times for up to three search levels, using the same atom values and different blocks of general indices at the observation frequency.

[0211] It is to be understood that the embodiments and variations shown and described herein are merely illustrative of the principles of this invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention. For instance, although this invention is discussed in terms of its application to speech recognition, the basic problem of rapid evaluation of a large number of pdfs, expressed as mixtures of separable kernels, occurs frequently in other areas of computing. The application of the invention to those areas is also claimed. 

What is claimed is:
 1. A speech label accelerator (SLA) comprising: an indirect memory adapted to store a fixed plurality of indexes corresponding to a fixed plurality of atom functions; an atom value memory coupled to the indirect memory, the atom value memory adapted to store a fixed plurality of atom values corresponding to a fixed plurality of atom functions, wherein each of the indexes selects one of the atom values in the atom value memory, wherein each of the atom values is determined for a particular input vector and a particular atom function, and wherein the atom functions are selected to represent a plurality of kernel functions thereby providing an approximation to the plurality of kernel functions; and adder circuitry coupled to the atom value memory, the adder circuitry adapted to add atom values selected by indexes of the indirect memory.
 2. The SLA of claim 1, wherein each of the atom functions has domain R^(d) for some plurality of dimensions, d.
 3. The SLA of claim 1, wherein each of the atom functions has domain R for a single dimension.
 4. The SLA of claim 1, wherein the adder circuitry comprises a pipelined tree of adders.
 5. The SLA of claim 4, wherein the pipelined tree of adders comprises a plurality of stages, each of the stages comprising a plurality of adders and at least one register.
 6. The SLA of claim 5, wherein a number of dimensions is denoted by d, wherein n is a stage number, wherein each stage comprises └d/(2^(n))┘ sums in parallel, and wherein there are ┌log₂d┐ stages.
 7. The SLA of claim 6, further comprising an accumulator coupled to the adder circuitry, wherein the adder circuitry further comprises a final stage when d is an integral power of two.
 8. The SLA of claim 1, further comprising an accumulator coupled to the adder circuitry, the accumulator adapted to accumulate at least one result of additions between atom values.
 9. The SLA of claim 1, wherein the adder circuitry comprises a pipelined adder chain.
 10. The SLA of claim 9, wherein the pipelined adder chain comprises a number of single dimension adders, wherein the number of single dimension adders is the same as the number of dimensions.
 11. The SLA of claim 10, wherein each single dimension adder comprises an adder adding a previous dimension adder output to a selected atom value, wherein the selected atom values are input to each of the single dimension adders in parallel.
 12. The SLA of claim 1, further comprising a load/accumulate multiplexer (mux) and an accumulator having an input and output, the load/accumulate mux having two inputs and an output, wherein the adder circuitry comprises a first and second adder, each having two inputs and an output, the inputs of the first adder coupled to the atom value memory, a first input of the second adder coupled to the output of the first adder, a second input of the second adder coupled to the output of the load/accumulate mux, an input of the load/accumulate mux coupled to the output of the accumulator, and the output of the second adder coupled to the input of the accumulator.
 13. The SLA of claim 12, wherein the accumulator comprises a demultiplexer (demux), a mux, and a plurality of registers, the demux having an input and a plurality of outputs, the mux having a plurality of inputs and an output, the input of the demux coupled to the input of the accumulator, each of the registers coupled to one output of the demux and to one input of the mux, and the output of the mux coupled to the output of the accumulator.
 14. The SLA of claim 8, further comprising a load/accumulate multiplexer (mux) having a first input coupled to the accumulator, an output coupled to an input of the adder circuitry, and a second input coupled to a zero value.
 15. The SLA of claim 14, further comprising a control unit coupled to the indirect memory, atom value memory, adder circuitry, and accumulator.
 16. The SLA of claim 1, wherein the atom and kernel functions are logarithms of other functions.
 17. The SLA of claim 1, wherein the kernel functions are completely separable.
 18. The SLA of claim 1, wherein the kernel functions are partially separable.
 19. The SLA of claim 1, wherein the atom and kernel functions are Gaussian functions.
 20. The SLA of claim 1, wherein the atom and kernel functions are non-Gaussian functions.
 21. The SLA of claim 1, wherein the atom functions are mixtures of Gaussians and the kernel functions are compound Gaussian functions.
 22. A system comprising: a processor; a memory coupled to the processor; and a speech label accelerator (SLA) coupled to the processor and the memory, the SLA comprising: an indirect memory adapted to store a fixed plurality of indexes corresponding to a fixed plurality of atom functions; an atom value memory coupled to the indirect memory, the atom value memory adapted to store a fixed plurality of atom values corresponding to a fixed plurality of atom functions, wherein each of the indexes selects one of the atom values in the atom value memory, wherein each of the atom values is determined for a particular input vector and a particular atom function, and wherein the atom functions are selected to represent a plurality of kernel functions thereby providing an approximation to the plurality of kernel functions; and adder circuitry coupled to the atom value memory, the adder circuitry adapted to add atom values selected by indexes of the indirect memory.
 23. A method comprising the steps of: determining, for a particular input vector, a plurality of atom values, wherein each of the atom values is determined from an atom function that represents a plurality of kernel functions thereby providing an approximation to the plurality of kernel functions; loading a portion of the plurality of atom values into an atom value memory adapted to store a fixed number of atom values; loading a portion of a plurality of indexes into an indirect memory adapted to store a fixed number of indexes, each of the loaded indexes adapted to select one of the atom values in the atom value memory, each of the loaded indexes corresponding to one of a fixed number of kernel functions; selecting at least one index from the indirect memory; retrieving at least one atom value corresponding to the at least one selected index from the atom value memory, one atom value retrieved per selected index; and accumulating the at least one retrieved atom value.
 24. The method of claim 23, further comprising the step of determining the plurality of indexes.
 25. The method of claim 23, further comprising the step of performing the steps of selecting, retrieving, and accumulating until all indexes corresponding to a selected one of the fixed number of kernel functions have been selected, wherein all atom values corresponding to the selected kernel function are accumulated.
 26. The method of claim 23, wherein the atom value memory comprises a size comprising a fixed number of atom functions by a fixed number of dimensions and wherein the indirect memory comprises a size comprising a fixed number of kernel functions by a fixed number of dimensions.
 27. The method of claim 23, wherein each of the atom functions has domain R^(d) for some plurality of dimensions, d.
 28. The method of claim 23, wherein each of the atom functions has domain R for a single dimension.
 29. The method of claim 25, wherein the step of performing the steps of selecting, retrieving, and accumulating until all indexes corresponding to a selected one of the fixed number of kernel functions have been selected further comprises the steps of performing the steps of selecting and retrieving in parallel for all indexes for the selected kernel function, whereby all atom values corresponding to indexes for the selected kernel function are retrieved in parallel, and performing the step of accumulating after all the atom values have been retrieved.
 30. The method of claim 29, wherein the step of accumulating is performed by a pipelined adder chain, and wherein the step of accumulating further comprises the steps of adding one of the retrieved atom values to another of the retrieved atom values and adding a result of all additions for all atom values into an accumulator.
 31. The method of claim 29, wherein the step of accumulating is performed by a pipelined tree of adders having a plurality of stages, and wherein the step of accumulating further comprises the steps of performing additions during each stage to add results from a previous stage, wherein the first stage adds a number of the atom values, and adding a result of all additions for all stages into an accumulator.
 32. The method of claim 25, wherein the step of performing the steps of selecting, retrieving, and accumulating until all indexes corresponding to a selected one of the fixed number of kernel functions have been selected further comprises the steps of performing the steps of selecting and retrieving in parallel for every two indexes for the selected kernel function, and performing the step of accumulating after the two atom values have been retrieved.
 33. The method of claim 23, wherein the step of accumulating the retrieved atom value further comprises the steps of: adding the retrieved atom value to a value from an accumulator to create a result; updating the accumulator with the result; and setting the accumulator to zero prior to the step of selecting at least one index from the atom value memory.
 34. The method of claim 25, wherein the method further comprises the step of selecting another of the kernel functions, and wherein the step of performing the steps of selecting, retrieving, and accumulating further comprises the steps of: performing the steps of selecting, retrieving, and accumulating until all indexes for the selected kernel function have been selected; and performing the previous step and the step of selecting another of the kernel functions until all the kernel functions have been selected, wherein all atom values, corresponding to indexes from the fixed number of kernel functions, are accumulated.
 35. The method of claim 25, wherein: the step of determining, for a particular input vector, a plurality of atom values further comprises the steps of determining, for a particular input vector, a plurality of atom values corresponding to a plurality of atom functions having a first number of dimensions, wherein the first number of dimensions is larger than a number of dimensions of the atom value memory; and separating the atom values into blocks, each block comprising atom functions having the number of dimensions of the atom value memory; the step of loading of portion of the plurality of atom values into an atom value memory comprises the step of loading a selected one of the blocks into atom value memory; and the step of performing the steps of selecting, retrieving, and accumulating further comprises the steps of: performing the steps of selecting, retrieving, and accumulating until all indexes corresponding to the selected kernel function and to the selected block have been selected; loading another selected block of atom values into the atom value memory; and performing the two previous steps until all blocks have been selected, wherein all atom values corresponding to indexes for the selected kernel function are accumulated.
 36. The method of claim 25, wherein: the step of determining, for a particular input vector, a plurality of atom values further comprises the steps of: selecting one of a plurality of hierarchical levels; determining, for a particular input vector, a plurality of atom values corresponding to a plurality of atom functions having a first number of dimensions, wherein the first number of dimensions is larger than a number of dimensions of the atom value memory; separating the atom values into blocks, each block comprising atom functions having the fixed number of dimensions; and assigning the blocks an order; the step of loading a portion of the plurality of atom values into the atom value memory comprises the step of loading a selected one of the blocks into atom value memory; and the step of performing the steps of selecting, retrieving, and accumulating further comprises the steps of: performing the steps of selecting, retrieving, and accumulating until all indexes for the selected block of the selected kernel function have been selected; selecting a next highest ordered block as the selected block and loading the selected block into the atom value memory; performing the two previous steps until all blocks have been selected, wherein all atom values corresponding to indexes for the selected kernel function and for the selected level are accumulated, wherein the last block in the order resides in the atom memory; selecting another of the hierarchical levels; performing the steps of selecting, retrieving, and accumulating until all indexes for the selected block of the selected kernel function have been selected; selecting a next lowest ordered block of atom values as the selected block loading the selected block into the atom value memory; performing the three previous steps until all blocks have been selected, wherein all atom values corresponding to indexes for the selected kernel function and for the selected level are accumulated.
 37. The method of claim 25, wherein: the step of determining, for a particular input vector, a plurality of atom values further comprises the steps of determining, for a particular input vector, a plurality of atom values corresponding to a plurality of atoms having a first number of dimensions, wherein the first number of dimensions is larger than a number of dimensions of the atom value memory; and separating the atom values into blocks, each block comprising atom functions having the number of dimensions of the atom value memory; the step of loading a portion of the plurality of atom values into the atom value memory comprises the step of loading a selected one of the blocks into atom value memory; the step of performing the steps of selecting, retrieving, and accumulating further comprises the steps of: performing the steps of selecting, retrieving, and accumulating until all indexes for one block of the selected kernel function have been selected; loading another selected block of atom values into the atom value memory; performing the two previous steps until all blocks have been selected, wherein all atom values corresponding to indexes for the selected kernel function are accumulated; and selecting another of the kernel functions and performing the step of performing the steps of selecting, retrieving, and accumulating, the step of loading another selected block, and the step of performing the two previous steps until all of the kernel functions have been selected, wherein all atom values, corresponding to indexes from the kernel functions, for the all of the kernel functions are accumulated.
 38. The method of claim 25, wherein: the step of determining, for a particular input vector, a plurality of atom values further comprises the steps of determining, for a particular input vector, a plurality of atom values corresponding to a first number of atoms, wherein the first number of atoms is larger than a number of dimensions of the atom value memory; and separating the atoms into blocks, each block comprising the number of dimensions of the atom value memory, but wherein each of the atom values for one atom in each block is zero; the step of loading a portion of the plurality of atom values into the atom value memory comprises the step of loading a selected one of the blocks into atom value memory; the step of performing the steps of selecting, retrieving, and accumulating further comprises the steps of: performing the steps of selecting, retrieving, and accumulating until all indexes for one block of the selected kernel function have been selected; loading another selected block of atom values into the atom value memory; and performing the two previous steps until all blocks have been selected, wherein all atom values corresponding to indexes for the selected kernel function are accumulated.
 39. The method of claim 23, wherein each of the atom and kernel functions is a logarithm of another function.
 40. The method of claim 23, wherein each of the kernel functions is completely separable.
 41. The method of claim 23, wherein at least one of the kernel functions is partially separable.
 42. The method of claim 23, wherein each of the atom and kernel functions is a Gaussian function.
 43. The method of claim 23, wherein the atom and kernel functions are non-Gaussian functions.
 44. The method of claim 23, wherein the atom functions are mixtures of Gaussians and the kernel functions are compound Gaussian functions. 